Neural Based Tabu Search method for solving unit commitment problem with cooling-banking constraints
نویسندگان
چکیده
منابع مشابه
Genetic Algorithm Based Tabu Search Method for Solving Unit Commitment Problem with Cooling –– Banking Constraints
This paper presents a new approach to solving the short-term unit commitment problem using the genetic algorithm based tabu search method with cooling and banking constraints. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal ge...
متن کاملIntegrating genetic algorithms and tabu search for unit commitment problem
Optimization is the art of obtaining optimum result under given circumstances. In design, construction and maintenance of any engineering system, Engineers have to take many technological and managerial decisions at several stages. The ultimate goal of all such decisions is to either maximize the desired benefit or to minimize the effort or the cost required. This paper shows a memetic algorith...
متن کاملSolving the Unit Commitment Problem by a Unit Decommitment Method
In this paper, we present a unified decommitment method to solve the unit commitment problem. This method starts with a solution having all available units online at all hours in the planning horizon and determines an optimal strategy for decommitting units one at a time. We show that the proposed method may be viewed as an approximate implementation of the Lagrangian relaxation approach and th...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
A Tabu Search Method for Interval Constraints
This article presents an extension of the Tabu Search (TS) metaheuristic to continuous CSPs, where the domains are represented by floating point-bounded intervals. This leads to redefine the usual TS operators to take into account the special features of interval constraints: real variables encoded in floating points domains, high cardinality of the domains, nature of the CSP where constraints ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Serbian Journal of Electrical Engineering
سال: 2009
ISSN: 1451-4869
DOI: 10.2298/sjee0901057r